On the Nearest Quadratically Invariant Information Constraint
نویسندگان
چکیده
منابع مشابه
On the Number of Iterations to the Closest Quadratically Invariant Information Constraint
Quadratic invariance is a condition which has been shown to allow for optimal decentralized control problems to be cast as convex optimization problems. The condition relates the constraints that the decentralization imposes on the controller to the structure of the plant. Recent work considered the problem of finding the closest subset and superset of the decentralization constraint which are ...
متن کاملThe ℋ2 Control Problem for Quadratically Invariant Systems With Delays
This paper gives a new solution to the output feedback H2 problem for quadratically invariant communication delay patterns. A characterization of all stabilizing controllers satisfying the delay constraints is given and the decentralized H2 problem is cast as a convex model matching problem. The main result shows that the model matching problem can be reduced to a finite-dimensional quadratic p...
متن کاملThe H2 Control Problem for Quadratically Invariant Systems with Delays
This paper gives a new solution to the output feedback H2 problem for quadratically invariant communication delay patterns. A characterization of all stabilizing controllers satisfying the delay constraints is given and the decentralized H2 problem is cast as a convex model matching problem. The main result shows that the model matching problem can be reduced to a finite-dimensional quadratic p...
متن کاملMutually Quadratically Invariant Information Structures in Two-Team Stochastic Dynamic Games
Abstract—We formulate a two-team linear quadratic stochastic dynamic game featuring two opposing teams each with decentralized information structures. We introduce the concept of mutual quadratic invariance (MQI), which, analogously to quadratic invariance in (single team) decentralized control, defines a class of interacting information structures for the two teams under which optimal linear f...
متن کاملConstraint Programming for Strictly Convex Integer Quadratically-Constrained Problems
Inspired by the geometric reasoning exploited in discrete ellipsoid-based search (DEBS) from the communications literature, we develop a constraint programming (CP) approach to solve problems with strictly convex quadratic constraints. Such constraints appear in numerous applications such as modelling the ground-to-satellite distance in global positioning systems and evaluating the efficiency o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2012
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2011.2173411